On the Expressive Power of the Normal Form for Branching-Time Temporal Logics

With the emerging applications that involve complex distributed systems branching-time specifications are specifically important as they reflect dynamic and non-deterministic nature of such applications. We describe expressive power a simple yet powerful specification framework -- normal form (BNF), which has been developed part clausal resolution for temporal logics. show encoding Buchi Tree Automata in language form, thus representing, syntactically, tree automata high-level way. Thus we can treat BNF latter. These results enable us (1) to translate given problem into apply verification method deductive reasoning technique resolution; (2) one core components loop searching extract, hidden invariants wide range specifications.